Evaluation of Software Programs for PAC
نویسندگان
چکیده
منابع مشابه
A Glance at Psychophysics Software Programs
Visual stimulation with precise control of stimulus has transformed the field of psychophysics since the introduction of personal computers. Luminance and chromatic features of stimulus, timing, and position of the stimulus are the main features that could be defined using programs written specifically for psychophysical experiments. In this manuscript, software used for the psychophysical expe...
متن کاملThe Pac-Learnability of Recursive Logic Programs
We analyze the learnability of function-free recursive logic programs in the models of polynomial predictability and identiication from equivalence queries. Our ultimate goal is delineating the boundaries of eecient learnability for recursive logic programs. In the rst portion of the paper, we describe a restricted class of recursive programs that is learnable from equivalence queries alone. Th...
متن کاملAccuracy and characteristics of cephalometric software programs for outcome prediction of orthognathic treatments: A review
Several software programs have been designed for outcome prediction of orthodontic and surgical treatments. This study aimed to review the accuracy and characteristics of cephalometric software programs for outcome prediction of orthognathic surgeries. This study reviewed studies that compared cephalometric software programs in terms of accuracy and characteristics for outcome prediction of o...
متن کاملPac-learning Recursive Logic Programs: Negative Results
In a companion paper it was shown that the class of constant-depth determinate k-ary recursive clauses is e ciently learnable. In this paper we present negative results showing that any natural generalization of this class is hard to learn in Valiant's model of paclearnability. In particular, we show that the following program classes are cryptographically hard to learn: programs with an unboun...
متن کاملPac-Learning Recursive Logic Programs: Efficient Algorithms
We present algorithms that learn certain classes of function-free recursive logic programs in polynomial time from equivalence queries. In particular, we show that a single k-ary recursive constant-depth determinate clause is learnable. Two-clause programs consisting of one learnable recursive clause and one constant-depth determinate non-recursive clause are also learnable, if an additional \b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Japanese journal of ergonomics
سال: 1994
ISSN: 0549-4974,1884-2844
DOI: 10.5100/jje.30.supplement_106